Approximation algorithms for MAX 4 - SATand rounding procedures for semide nite programs
نویسندگان
چکیده
Karloo and Zwick obtained recently an optimal 7=8-approximation algorithm for MAX 3-SAT. In an attempt to see whether similar methods can be used to obtain a 7=8-approximation algorithm for MAX SAT, we consider the most natural generalization of MAX 3-SAT, namely MAX 4-SAT. We present a semideenite programming relaxation of MAX 4-SAT and a new family of rounding procedures that try to cope well with clauses of various sizes. We study the potential, and the limitations, of the relaxation and of the proposed family of rounding procedures using a combination of theoretical and experimental means. We select two rounding procedures from the proposed family of rounding procedures. Using the rst rounding procedure we seem to obtain an almost optimal 0:8721-approximation algorithm for MAX 4-SAT. Using the second rounding procedure we seem to obtain an optimal 7=8-approximation algorithm for satissable instances of MAX 4-SAT. On the other hand, we show that no rounding procedure from the family considered can be shown, using the current techniques, to yield an approximation algorithm for MAX 4-SAT whose performance guarantee on all instances of the problem is greater than 0:8724. We also show that the the integrality ratio of the proposed relaxation, as a relaxation of MAX f1; 4g-SAT is at most 0:8754. The 0:8721-approximation for MAX 4-SAT that we seem to obtain substantially improves the performance guarantees of all previous algorithms suggested for the problem. It is extremely close to being optimal as a (7=8 +)-approximation algorithm for MAX 4-SAT, for any xed > 0, would imply that P=NP. Our investigation also indicates, however, that additional ideas are required in order to obtain optimal 7=8-approximation algorithms for MAX 4-SAT and MAX SAT. Although most of this paper deals speciically with the MAX 4-SAT problem, we believe that the new family of rounding procedures introduced, and the methodology used in the design and in the analysis of the various rounding procedures considered would have a much wider range of applicability.
منابع مشابه
The RPR 2 rounding technique for semide nite programsUriel
Several combinatorial optimization problems can be approximated using algorithms based on semideenite programming. In many of these algorithms a semideenite relaxation of the underlying problem is solved yielding an optimal vector connguration v 1 : : : v n. This vector connguration is then rounded into a f0; 1g solution. We present a procedure called RP R 2 (Random Projection followed by Rando...
متن کاملSome New Randomized Approximation Algorithms
The topic of this thesis is approximation algorithms for optimization versions of NP-complete decision problems. No exact algorithms with sub-exponential running times are known for these problems, and therefore approximation algorithms with polynomial running times are studied. An approximation algorithm does not necessarily nd the optimal solution, but it leaves a guarantee of how far from th...
متن کاملApproximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
Karloo and Zwick obtained recently an optimal 7=8-approximation algorithm for MAX 3-SAT. In an attempt to see whether similar methods can be used to obtain a 7=8-approximation algorithm for MAX SAT, we consider the most natural generalization of MAX 3-SAT, namely MAX 4-SAT. We present a semideenite programming relaxation of MAX 4-SAT and a new family of rounding procedures that try to cope well...
متن کاملOn the optimality of the random hyperplane rounding technique for MAX CUT
MAX CUT is the problem of partitioning the vertices of a graph into two sets max imizing the number of edges joining these sets This problem is NP hard Goemans and Williamson proposed an algorithm that rst uses a semide nite programming relaxation of MAX CUT to embed the vertices of the graph on the surface of an n dimensional sphere and then uses a random hyperplane to cut the sphere in two gi...
متن کاملApproximate Graph Coloring by Semide nite
We consider the problem of coloring k-colorable graphs with the fewest possible colors. We present a randomized polynomial time algorithm which colors a 3-colorable graph on n vertices with minfO((1=3 log 4=3); O(n 1=4 log n)g colors where is the maximum degree of any vertex. Besides giving the best known approximation ratio in terms of n, this marks the rst non-trivial approximation result as ...
متن کامل